13 research outputs found
Using the discrete hadamard transform to detect moving objects in surveillance video
In this paper we present an approach to object detection in surveillance video based on detecting moving edges
using the Hadamard transform. The proposed method is characterized by robustness to illumination changes
and ghosting effects and provides high speed detection, making it particularly suitable for surveillance applications.
In addition to presenting an approach to moving edge detection using the Hadamard transform, we
introduce two measures to track edge history, Pixel Bit Mask Difference (PBMD) and History Update Value
(H UV ) that help reduce the false detections commonly experienced by approaches based on moving edges.
Experimental results show that the proposed algorithm overcomes the traditional drawbacks of frame differencing
and outperforms existing edge-based approaches in terms of both detection results and computational
complexity
Low complexity video compression using moving edge detection based on DCT coefficients
In this paper, we propose a new low complexity video compression method based on detecting blocks containing moving edges us- ing only DCT coe±cients. The detection, whilst being very e±cient, also allows e±cient motion estimation by constraining the search process to moving macro-blocks only. The encoders PSNR is degraded by 2dB com- pared to H.264/AVC inter for such scenarios, whilst requiring only 5% of the execution time. The computational complexity of our approach is comparable to that of the DISCOVER codec which is the state of the art low complexity distributed video coding. The proposed method ¯nds blocks with moving edge blocks and processes only selected blocks. The approach is particularly suited to surveillance type scenarios with a static camera
Complexity adaptation in H.264/AVC video coder for static cameras
H.264/AVC uses variable block size motion estimation (VBSME)
to improve coding gain. However, its complexity is significant
and fixed regardless of the required quality or of the
scene characteristics. In this paper, we propose an adaptive
complexity algorithm based on using the Walsh Hadamard
Transform (WHT). VBS automatic partition and skip mode
detection algorithms also are proposed. Experimental results
show that 70% - 5% of the computation of H.264/AVC is required
to achieve the same PSNR
Fast intra prediction in the transform domain
In this paper, we present a fast intra prediction method based on separating the transformed coefficients. The
prediction block can be obtained from the transformed and quantized neighboring block generating minimum distortion
for each DC and AC coefficients independently. Two prediction methods are proposed, one is full block search
prediction (FBSP) and the other is edge based distance prediction (EBDP), that find the best matched transformed
coefficients on additional neighboring blocks. Experimental results show that the use of transform coefficients
greatly enhances the efficiency of intra prediction whilst keeping complexity low compared to H.264/AVC
Low computational complexity variable block size (VBS) partitioning for motion estimation using the Walsh Hadamard transform (WHT)
Variable Block Size (VBS) based motion estimation has
been adapted in state of the art video coding, such as
H.264/AVC, VC-1. However, a low complexity H.264/AVC
encoder cannot take advantage of VBS due to its power consumption
requirements. In this paper, we present a VBS partition
algorithm based on a binary motion edge map without
either initial motion estimation or Rate-Distortion (R-D)
optimization for selecting modes. The proposed algorithm
uses the Walsh Hadamard Transform (WHT) to create a binary
edge map, which provides a computational complexity
cost effectiveness compared to other light segmentation
methods typically used to detect the required region
Complexity adaptation in video encoders for power limited platforms
With the emergence of video services on power limited platforms, it is necessary to consider both performance-centric and constraint-centric signal processing techniques. Traditionally, video applications have a bandwidth or computational resources constraint or both. The recent H.264/AVC video compression standard offers significantly improved efficiency and flexibility compared to previous standards, which leads to less emphasis on bandwidth. However, its high computational complexity is a problem for codecs running on power limited plat- forms. Therefore, a technique that integrates both complexity and bandwidth issues in a single framework should be considered.
In this thesis we investigate complexity adaptation of a video coder which focuses on managing computational complexity and provides significant complexity savings when applied to recent standards. It consists of three sub functions specially designed for reducing complexity and a framework for using these sub functions; Variable Block Size (VBS) partitioning, fast motion estimation, skip macroblock detection, and complexity adaptation framework.
Firstly, the VBS partitioning algorithm based on the Walsh Hadamard Transform (WHT) is presented. The key idea is to segment regions of an image as edges or flat regions based on the fact that prediction errors are mainly affected by edges. Secondly, a fast motion estimation algorithm called Fast Walsh Boundary Search (FWBS) is presented on the VBS partitioned images. Its results outperform other commonly used fast algorithms. Thirdly, a skip macroblock detection algorithm is proposed for use prior to motion estimation by estimating the Discrete Cosine Transform (DCT) coefficients after quantisation. A new orthogonal transform called the S-transform is presented for predicting Integer DCT coefficients from Walsh Hadamard Transform coefficients. Complexity saving is achieved by deciding which macroblocks need to be processed and which can be skipped without processing. Simulation results show that the proposed algorithm achieves significant complexity savings with a negligible loss in rate-distortion performance. Finally, a complexity adaptation framework which combines all three techniques mentioned above is proposed for maximizing the perceptual quality of coded video on a complexity constrained platform
Automatic camera selection for activity monitoring in a multi-camera system for tennis
In professional tennis training matches, the coach needs to be able to view play from the most appropriate angle in order to monitor players' activities. In this paper, we describe and evaluate a system for automatic camera selection from a network of synchronised cameras within a tennis sporting arena. This work combines synchronised video streams from multiple cameras into a single summary video suitable for critical review by both tennis players and coaches. Using an overhead camera view, our system automatically determines the 2D tennis-court calibration resulting in a mapping that relates a player's position in the overhead camera to their position and size in another camera view in the network. This allows the system to determine the appearance of a player in each of the other cameras and thereby choose the best view for each player via a novel technique. The video summaries are evaluated in end-user studies and shown to provide an efficient means of multi-stream visualisation for tennis player activity monitoring
Low complexity intra video coding using transform domain prediction
In this paper, a new low complexity intra coding framework is presented. The proposed method is extremely computationally efficient as it uses intra prediction in the DCT domain. To facilitate finding a good predictor, we propose to extend the number of neighouring blocks to be searched, based on a consideration of the type of edges we can expect to observe in the pixel data. The best predictor can be selected from the candidate blocks without recourse to rate-distortion optimisation or pixel interpolation. To obtain better performance we also propose to automatically adapt the entropy encoding block to the prediction mode used. Experimental results show that the encoding scheme compares favorably to H.264/AVC in terms of compression efficiency but with a significant reduction in overall computational complexity
Development of Gait Rehabilitation System Capable of Assisting Pelvic Movement of Normal Walking
Gait rehabilitation training with robotic exoskeleton is drawing attention as a method for more advanced gait rehabilitation training. However, most of the rehabilitation robots are mainly focused on locomotion training in the sagittal plane. This study introduces a novel gait rehabilitation system with actuated pelvic motion to generate natural gait motion. The rehabilitation robot developed in this study, COWALK, is a lower-body exoskeleton system with 15 degrees of freedom (DoFs). The COWALK can generate multi-DoF pelvic movement along with leg movements. To produce natural gait patterns, the actuation of pelvic movement is essential. In the COWALK, the pelvic movement mechanism is designed to help hemiplegic patients regain gait balance during gait training. To verify the effectiveness of the developed system, the gait patterns with and without pelvic movement were compared to the normal gait on a treadmill. The experimental results show that the active control of pelvic movement combined with the active control of leg movement can make the gait pattern much more natural
Complexity adaptation in video encoders for power limited platforms
With the emergence of video services on power limited platforms, it is necessary to consider both performance-centric and constraint-centric signal processing techniques. Traditionally, video applications have a bandwidth or computational resources constraint or both. The recent H.264/AVC video compression standard offers significantly improved efficiency and flexibility compared to previous standards, which leads to less emphasis on bandwidth. However, its high computational complexity is a problem for codecs running on power limited plat- forms. Therefore, a technique that integrates both complexity and bandwidth issues in a single framework should be considered.
In this thesis we investigate complexity adaptation of a video coder which focuses on managing computational complexity and provides significant complexity savings when applied to recent standards. It consists of three sub functions specially designed for reducing complexity and a framework for using these sub functions; Variable Block Size (VBS) partitioning, fast motion estimation, skip macroblock detection, and complexity adaptation framework.
Firstly, the VBS partitioning algorithm based on the Walsh Hadamard Transform (WHT) is presented. The key idea is to segment regions of an image as edges or flat regions based on the fact that prediction errors are mainly affected by edges. Secondly, a fast motion estimation algorithm called Fast Walsh Boundary Search (FWBS) is presented on the VBS partitioned images. Its results outperform other commonly used fast algorithms. Thirdly, a skip macroblock detection algorithm is proposed for use prior to motion estimation by estimating the Discrete Cosine Transform (DCT) coefficients after quantisation. A new orthogonal transform called the S-transform is presented for predicting Integer DCT coefficients from Walsh Hadamard Transform coefficients. Complexity saving is achieved by deciding which macroblocks need to be processed and which can be skipped without processing. Simulation results show that the proposed algorithm achieves significant complexity savings with a negligible loss in rate-distortion performance. Finally, a complexity adaptation framework which combines all three techniques mentioned above is proposed for maximizing the perceptual quality of coded video on a complexity constrained platform